Contour approximation of data: A duality theory
نویسندگان
چکیده
منابع مشابه
Contour Approximation of Data: a Duality Theory
Abstract. Given a dataset D partitioned in clusters, the joint distance function (JDF) J(x) at any point x is the harmonic mean of the distances of x from the cluster centers. The JDF is a continuous function capturing the data points in its lower level sets (a property called contour approximation), and is a useful concept in probabilistic clustering and data analysis. The JDF of the whole dat...
متن کاملDuality in Perturbation Theory and the Quantum Adiabatic Approximation
Duality is considered for the perturbation theory by deriving, given a series solution in a small parameter, its dual series with the development parameter being the inverse of the other. A dual symmetry in perturbation theory is identified. It is then shown that the dual to the Dyson series in quantum mechanics is given by a recently devised series having the adiabatic approximation as leading...
متن کاملScattered data approximation of fully fuzzy data by quasi-interpolation
Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$. In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...
متن کاملA DUALITY APPROXIMATION OF SOME NONLINEAR PDE’s∗
We discuss a discretization approach for the p Laplacian equation and a variational inequality associated to fourth order elliptic operators, via a meshless approach based on duality theory. MSC: 35J20, 35J25, 65N99. keywords: nonlinear elliptic equations, Fenchel theorem, approximation, meshless method.
متن کاملA Duality Theory for
Recent studies of the algebraic properties of bilattices have provided insight into their internal structures, and have led to practical results, especially in reducing the computational complexity of bilattice-based multi-valued logic programs. In this paper the representation theorem for interlaced bilattices with negation found in 18] and extended to arbitrary interlaced bilattices without n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2009
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.01.023